P2P routing table poisoning: A quorum-based sanitizing approach
نویسندگان
چکیده
Peer-to-Peer (P2P) protocols underlie multiple networked applications given that the P2P decentralized design inherently fosters scalability and robustness. While distributiveness and scalability are attractive features, these facets also increase exposure to malicious peers which can propagate malicious routing information. Accordingly, a diverse set of continuously evolving attacks can be mounted that can cause severe service impairments over the entire overlay network. Most proposed countermeasures focus on providing diversity or redundancy to overcome malicious routing information with their emphasis on periodic detection/removal mechanisms done locally within a peer as continuous monitoring or global sharing of peer status entails high costs. However, a local approach naturally also limits the global effectiveness prompting the need for distributed solutions. In this work, we build upon contemporary distributed solutions (that developed specific attack detection and mitigation techniques for specific overlay types and specific attacks), to propose a generalized attack detection and mitigation approach applicable to varied overlay and attack models. Consequently, we propose a novel and efficient routing table sanitizing approach that (a) is independent of a specific attack variant, lookup approach or a specific victim set, (b) continuously detects and subsequently removes malicious routing information based on distributed quorum decisions, and (c) efficiently forwards malicious information findings to other peers which allows for progressive global sanitizing. The generalized mechanism shows a high sanitizing accuracy of up to 90% when evaluated against a generalized attack scenario with various adversarial behaviors.
منابع مشابه
The Continuous-Discrete Approach for Designing P2P Networks and Algorithms
One of the most intriguing trends in the development of internet applications in past few years is the immense rise in popularity of peer-to-peer (P2P) applications and networks. Peer-to-peer networks are characterized by the lack of central control or a-priori hierarchical organization in which all or most communication is symmetric. Moreover a P2P system is expected to scale gracefully as the...
متن کاملA cross-layer approach for real-time multimedia streaming on wireless peer-to-peer ad hoc network
Peer-to-peer (P2P) live streaming over mobile ad hoc network (MANET) is a state-of-theart technique for wireless multimedia applications, such as entertainments and disaster recovery. The peers share the live streaming over MANET via multi-hop wireless link, so an efficient data delivery scheme must be required. However, the high churn rate and the frequent mobility baffle the P2P membership ma...
متن کاملRelaxing Routing Table to Alleviate Dynamism in P2P Systems
In dynamic P2P networks, nodes join and depart from the system frequently, which partially damages the predefined P2P structure, and impairs the system performance such as basic lookup functionality. Therefore stabilization process has to be done to restore the logical topology. This paper presents an approach to relax the requirement on routing tables to provide provably better stability than ...
متن کاملA Simulation-based XML Routing Synopsis in Unstructured P2P Networks
Many emerging applications that use XML are distributed, usually over large peer-to-peer (P2P) networks on the Internet. The deployment of an XML query shipping system over P2P networks requires a specialized synopsis to capture XML data in routing tables. In this paper, we propose a novel graph-structured routing synopsis, called kd-synopsis, for deployment over unstructured super-peer based P...
متن کاملPurpose and security analysis of RASTER
In this paper we survey the purpose of the RASTER routing protocol and study its input on a P2P network’s security. Routing in P2P-systems using adaptive distributed hash tables (DHT) poses di↵erent challenges than routing in traditional deterministic DHT-based P2P systems. Routing algorithms designed for deterministic DHTs do not always find those shortest paths in adaptive networks. The routi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & Security
دوره 65 شماره
صفحات -
تاریخ انتشار 2017